Abstraction Heuristics, Cost Partitioning and Network Flows
نویسندگان
چکیده
ion Heuristics, Cost Partitioning and Network Flows Florian Pommerening and Malte Helmert University of Basel, Switzerland {florian.pommerening, malte.helmert}@unibas.ch Blai Bonet Universidad Simón Bolívar, Caracas, Venezuela [email protected]
منابع مشابه
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning
Cost partitioning is a general method for adding multiple heuristic values admissibly. In the setting of optimal classical planning, saturated cost partitioning has recently been shown to be the cost partitioning algorithm of choice for pattern database heuristics found by hill climbing, systematic pattern database heuristics and Cartesian abstraction heuristics. To evaluate the synergy of the ...
متن کاملState-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning (Extended Abstract)
Abstraction heuristics are a popular method to guide optimal search algorithms in classical planning. Cost partitionings allow to sum heuristic estimates admissibly by partitioning action costs among the abstractions. We introduce state-dependent cost partitionings which take context information of actions into account, and show that an optimal state-dependent cost partitioning dominates its st...
متن کاملState-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning
Abstraction heuristics are a popular method to guide optimal search algorithms in classical planning. Cost partitionings allow to sum heuristic estimates admissibly by distributing action costs among the heuristics. We introduce statedependent cost partitionings which take context information of actions into account, and show that an optimal state-dependent cost partitioning dominates its state...
متن کاملAdditive Merge-and-Shrink Heuristics for Diverse Action Costs
In many planning applications, actions can have highly diverse costs. Recent studies focus on the effects of diverse action costs on search algorithms, but not on their effects on domain-independent heuristics. In this paper, we demonstrate there are negative impacts of action cost diversity on merge-and-shrink (M&S), a successful abstraction method for producing high-quality heuristics for pla...
متن کاملFrom Non-Negative to General Operator Cost Partitioning
Operator cost partitioning is a well-known technique to make admissible heuristics additive by distributing the operator costs among individual heuristics. Planning tasks are usually defined with non-negative operator costs and therefore it appears natural to demand the same for the distributed costs. We argue that this requirement is not necessary and demonstrate the benefit of using general c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017